Efficient State Preparation for Quantum Amplitude Estimation

نویسندگان

چکیده

Quantum Amplitude Estimation (QAE) can achieve a quadratic speed-up for applications classically solved by Monte Carlo simulation. A key requirement to realize this advantage is efficient state preparation. If preparation too expensive, it diminish the quantum advantage. Preparing arbitrary states has exponential complexity with respect number of qubits, thus, not applicable. Currently known techniques require problems based on log-concave probability distributions, involve learning an unknown distribution from empirical data, or fully rely arithmetic. In paper, we introduce approach simplify preparation, together circuit optimization technique, both which help reduce QAE significantly. We demonstrate introduced numerical integration example real hardware, as well option pricing under Heston model, i.e., stochastic volatility process, using

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information criteria for efficient quantum state estimation

Recently several more efficient versions of quantum state tomography have been proposed, with the purpose of making tomography feasible even for many-qubit states. The number of state parameters to be estimated is reduced by tentatively introducing certain simplifying assumptions on the form of the quantum state, and subsequently using the data to rigorously verify these assumptions. The simpli...

متن کامل

Efficient state preparation for a register of quantum bits

We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover’s quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of ...

متن کامل

Quantum Amplitude Amplification and Estimation

Consider a Boolean function χ : X → {0, 1} that partitions set X between its good and bad elements, where x is good if χ(x) = 1 and bad otherwise. Consider also a quantum algorithm A such that A|0〉 = ∑ x∈X αx|x〉 is a quantum superposition of the elements of X, and let a denote the probability that a good element is produced if A|0〉 is measured. If we repeat the process of running A, measuring t...

متن کامل

Efficient State Preparation via Ion Trap Quantum Computing and Quantum Searching Algorithm

We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grover’s quantum search algorithm acting on trapped ions. Typeset using REVTEX 1 Quantum computing [1-5] is a field at the junction of modern physics and theoretical computer science. Practical experiments involving a few quantum bits have been successfully...

متن کامل

Efficient quantum state tomography.

Quantum state tomography--deducing quantum states from measured data--is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger systems it becomes unfeasible because the number of measurements and the amount of computation required to process them grows exponentially in the system size. Here, we present two tom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review applied

سال: 2021

ISSN: ['2331-7043', '2331-7019']

DOI: https://doi.org/10.1103/physrevapplied.15.034027